Parallel Algorithms for Generating Harmonised State Identifiers and Characterising Sets
نویسندگان
چکیده
منابع مشابه
A Parallel Accelerator for Generating Virtual Studio Sets
Recent developments in digital video techniques and the use of computers in video and television production provide new opportunities for programmes. Key technologies which embrace these developments are advanced computer graphics techniques for photorealistic rendering, image analysis and animation. Parallel processing provides the potential for practical utilization of these techniques. We de...
متن کاملGenerating Parallel Algorithms for Cluster and Grid Computing
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to obtain a systolic matrix product algorithm, and to compute the alignment score of two strings. The product of two n × n matrices is viewed as multiplying two p × p matrices whose elements are n/p × n/p submatrices. For...
متن کاملAlgorithms for generating convex sets in acyclic digraphs
A set X of vertices of an acyclic digraph D is convex if X ̸= ∅ and there is no directed path between vertices of X which contains a vertex not in X. A set X is connected if X ̸= ∅ and the underlying undirected graph of the subgraph ofD induced byX is connected. Connected convex sets and convex sets of acyclic digraphs are of interest in the area of modern embedded processor technology. We constr...
متن کاملEfficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
A maximal bipartite set (MBS) in an undirected graph G = (V;E) is a maximal collection of vertices B V whose induced subgraph is bipartite. In this paper we present efficient sequential (linear time) and parallel (NC) algorithms for constructing an MBS.
متن کاملParallel State Space Searching Algorithms
As a pedagogical exercise in parallel programming and scientific computing, we looked at the problem of state space searching. We focused on the standard example problem, the 15-puzzle, and developed original C++ code which quickly and efficiently finds solutions to the puzzle on a parallel machine, using two different algorithms. In this paper, we summarize the theory behind our two parallel i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2016
ISSN: 0018-9340
DOI: 10.1109/tc.2016.2532869